Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic

The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to oating-point arithmetic. The resulting ADZ method enables one to generate decomposable data structures | both labelled or unlabelled | uniformly at random, in expected O(n ) time and space, after a preprocessing phase of O(n ) time, which reduces to O(n ) for context-free grammars. Key-words: uniform random generation, decomposable structure, interval arithmetic